Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
arxiv.org·1d
Making a Language
thunderseethe.dev·7h
Subterms Modulo Theories I
philipzucker.com·3d
Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
arxiv.org·47m
Explainer: Tree-sitter vs. LSP
lambdaland.org·1d
Alexis King’s Blog
lexi-lambda.github.io·2d
Dealing with alternatives
jemarch.net·1d
How Static Analysis Can Expose Personal Data Hidden in Source Code
hackernoon.com·17h
IPAB Workshop - 22/1/26 | IPAB
informatics.ed.ac.uk·20h
Loading...Loading more...